algorithmic number

См. также в других словарях:

• Algorithmic Number Theory Symposium — (ANTS) is an academic conference.Since their inception in Cornell in 1994, the biennial ANTS meetings have become the premier international forums for the presentation of new research in computational number theory. They are devoted to… …   Wikipedia

• Algorithmic information theory — is a subfield of information theory and computer science that concerns itself with the relationship between computation and information. According to Gregory Chaitin, it is the result of putting Shannon s information theory and Turing s… …   Wikipedia

• Algorithmic composition — is the technique of using algorithms to create music.Algorithms (or, at the very least, formal sets of rules) have been used to compose music for centuries; the procedures used to plot voice leading in Western counterpoint, for example, can often …   Wikipedia

• Algorithmic art — Algorithmic art, also known as algorithm art , is art, mostly visual art, of which the design is generated by an algorithm. Algorithmic artists are sometimes called algorists. Overview Algorithmic art is a subset of generative art, and is… …   Wikipedia

• Algorithmic learning theory — (or algorithmic inductive inference) is a framework for machine learning.The framework was introduced in E. Mark Gold s seminal paper Language identification in the limit . The objective of language identification is for a machine running one… …   Wikipedia

• algorithmic — adj. 1. of or pertaining to an algorithm. {recursive} [1913 Webster] 2. definitively solvable by a finite number of steps; said of mathematical or logical problems. Contrasted with {heuristic}. [WordNet 1.5] …   The Collaborative International Dictionary of English

• Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… …   Wikipedia

• Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …   Wikipedia

• Discriminant of an algebraic number field — A fundamental domain of the ring of integers of the field K obtained from Q by adjoining a root of x3 − x2 − 2x + 1. This fundamental domain sits inside K ⊗QR. The discriminant of K is 49 = 72.… …   Wikipedia

• Computational number theory — In mathematics, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations. The best known problem in the field is integer factorization. See also Computational… …   Wikipedia

• Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… …   Wikipedia